merge sorting

英 [mɜːdʒ ˈsɔːtɪŋ]

美 [mɜːrdʒ ˈsɔːrtɪŋ]

网络归并排序; 排序法; 归并排序法; 合并排序

So when compared to a nested loop join, the merge scan join may incur the cost for sorting the inputs.
因此，当与嵌套循环联接比较时，合并扫描联接可能对于排序输入产生成本。
In this paper a fast parallel merge sorting algorithm based on LARPBS is presented.
应用左递归二叉树构造一个新的并行排序算法，对p个有序块进行排序。
A Parallel Merge Sorting Algorithm for Reconfigurable Computational Models Based on Wide-Bandwidth Bus Networks
带有宽总线网络的可重构计算模型上的并行归并排序算法
A Valiant Parallel Merge Sorting Algorithm Based on Reconfigurable Optical Pipeline Bus
基于流水光总线阵列上Valiant并行归并排序的实现
The Influence of the Balance of Subproblem on Time Complexity of Merge Sorting
子问题平衡对合并排序时间复杂性的影响
Bilateral nature-merge sorting algorithm
双向自然合并排序算法
Most merge sorting algorithms adopt 2-sorters as their basic units in their implementations. A 2-sorters means the comparison and exchange of 2 items.
目前对基于归并的排序算法的研究中，大都以2-sorters为其基本构件，即两个数的比较交换。